A theory of timed automata

A Theory of Timed Automata

Alur, R. and D.L. Dill, A theory of timed automata, Theoretical Computer Science 126 (1994) 183-235. We propose timed (j&e) automata to model the behavior of real-time systems over time. Our definition provides a simple, and yet powerful, way to annotate state-transition graphs with timing constraints using finitely many real-valued clocks. A timed automaton accepts timed words-infinite sequenc...

A Theory of Timed Automata 1

Towards a Unified Theory of Timed Automata

Title of dissertation: TOWARDS A UNIFIED THEORY OF TIMED AUTOMATA Peter Christopher Fontana, Doctor of Philosophy, 2014 Dissertation directed by: Professor Rance Cleaveland Department of Computer Science Timed automata are finite-state machines augmented with special clock variables that reflect the advancement of time. Able to both capture real-time behavior and be verified algorithmically (mo...

Priced Timed Automata: Theory & Tools

Priced timed automata are emerging as useful formalisms for modeling and analysing a broad range of resource allocation problems. In this extended abstract, we highlight recent (un)decidability results related to priced timed automata as well as point to a number of open problems.

The Theory of Timed I/O Automata

This monograph presents the Timed Input/Output Automaton (TIOA) modeling framework, a basic mathematical framework to support description and analysis of timed (computing) systems. Timed systems are systems in which desirable correctness or performance properties of the system depend on the timing of events, not just on the order of their occurrence. Timed systems are employed in a wide range o...